Descriptive and Parameterized Complexity
نویسنده
چکیده
منابع مشابه
Describing Parameterized Complexity Classes
We describe parameterized complexity classes by means of classical complexity theory and descriptive complexity theory. For every classical complexity class we introduce a parameterized analogue in a natural way. In particular, the analogue of polynomial time is the class of all fixed-parameter tractable problems. We develop a basic complexity theory for the parameterized analogues of classical...
متن کاملSome Lower Bounds in Parameterized AC^0
We demonstrate some lower bounds for parameterized problems via parameterized classes corresponding to the classical AC0. Among others, we derive such a lower bound for all fptapproximations of the parameterized clique problem and for a parameterized halting problem, which recently turned out to link problems of computational complexity, descriptive complexity, and proof theory. To show the fir...
متن کاملSome lower bounds in parameterized ${\rm AC}^0$
We demonstrate some lower bounds for parameterized problems via parameterized classes corresponding to the classical AC. Among others, we derive such a lower bound for all fptapproximations of the parameterized clique problem and for a parameterized halting problem, which recently turned out to link problems of computational complexity, descriptive complexity, and proof theory. To show the firs...
متن کاملar X iv : c s / 99 10 00 1 v 1 [ cs . C C ] 1 O ct 1 99 9 Fixed - Parameter Tractability and Logic
We exhibit a close connection between parameterized complexity theory and logic. Our approach is that of descriptive complexity theory. We study the definability of parameterized problems and try to obtain information about the parameterized complexity of the problems through the syntactical structure of the defining sentences. On the one hand, we use this approach to prove that certain problem...
متن کاملFixed-Parameter Tractability, Definability, and Model-Checking
In this article, we study parameterized complexity theory from the perspective of logic, or more specifically, descriptive complexity theory. We propose to consider parameterized model-checking problems for various fragments of first-order logic as generic parameterized problems and show how this approach can be useful in studying both fixed-parameter tractability and intractability. For exampl...
متن کامل